Generalized DNA Barcode Design Based on Hamming Codes
نویسنده
چکیده
The diversity and scope of multiplex parallel sequencing applications is steadily increasing. Critically, multiplex parallel sequencing applications methods rely on the use of barcoded primers for sample identification, and the quality of the barcodes directly impacts the quality of the resulting sequence data. Inspection of the recent publications reveals a surprisingly variable quality of the barcodes employed. Some barcodes are made in a semi empirical fashion, without quantitative consideration of error correction or minimal distance properties. After systematic comparison of published barcode sets, including commercially distributed barcoded primers from Illumina and Epicentre, methods for improved, Hamming code-based sequences are suggested and illustrated. Hamming barcodes can be employed for DNA tag designs in many different ways while preserving minimal distance and error-correcting properties. In addition, Hamming barcodes remain flexible with regard to essential biological parameters such as sequence redundancy and GC content. Wider adoption of improved Hamming barcodes is encouraged in multiplex parallel sequencing applications.
منابع مشابه
A class of cyclotomic linear codes and their generalized Hamming weights
Abstract Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two alternative formulas to calculate their generalized Hamming weights. Lastly, we determine their weight distribution and generalized Hamming weights partial...
متن کاملThe Second Generalized Hamming Weight of Some Evaluation Codes Arising from Complete Bipartite Graphs
In this paper we compute the second generalized Hamming weight of the evaluation codes associated to complete bipartite graphs. The main result depends on the minimum distance and second generalized Hamming weight of the generalized Reed-Solomon codes.
متن کاملGeneralized Extended Hamming Codes over Galois Ring of Characteristic $2^{n}$
In this paper, we introduce generalized extended Hamming codes over Galois rings GR(2,m) of characteristic 2 with extension degree m. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over GR(2,m) is 4 and the minimum Lee weight of generalized extended Hamming codes over GR(8,m) is 6 for all m ≥ 3. ——————————————————————– ———Received May 25, 2011. This w...
متن کاملClass of Binary Generalized Goppa Codes Perfect in Weighted Hamming Metric
The class of the binary generalized Goppa codes is offered. It is shown that the codes of this class are on the Hamming bound constructed for a weighted metric.
متن کاملEfficient Matrix Codes for Error Correction in Memory
In CMOS integrated circuits, electronic memories are widely used. As transistor size shrinks, multiple cell upsets are becoming an increasingly important factor in the reliability of memories exposed to radiation effects. To prevent the MCUs from causing data corruption, more complex error correction codes (ECCs) are widely used to protect memory. Recently, matrix codes (MCs) based on Hamming c...
متن کامل